Proving Properties of States in the Situation Calculus
نویسنده
چکیده
In the situation calculus, it is sometimes necessary to prove that certain properties are true in all world states accessible from the initial state. This is the case for some forms of reasoning about the physical world, for certain planning applications, and for verifying integrity constraints in databases. Not surprisingly, this requires a suitable form of mathematical induction. This paper motivates the need for proving properties of states in the situation calculus, proposes appropriate induction principles for this task, and gives examples of their use in databases and for reasoning about the physical world.
منابع مشابه
NON-POLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS
A Class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Convergence anal...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملOn Formalizing Database Updates: Preliminary Report
We address the problem of formalizing the evolution of a database under the eeect of an arbitrary sequence of update transactions. We do so by appealing to a rst order representation language called the situation calculus, which is a standard approach in artiicial intelligence to the formalization of planning problems. We formalize database transactions in exactly the same way as actions in the...
متن کاملOn the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile robots. Although such agents’ tasks are typically open-ended, little attention has been paid so far to the analysis of non-terminating GOLOG control programs. Recently we therefore introduced a logic that allows to express propert...
متن کاملHypothetical Temporal Reasoning with History Encoding
In this paper we integrate a history{encoding based methodology developed by Chomicki for checking dynamic database integrity constraints into a situation-calculus based speciication of database updates as proposed by Reiter. By doing this, we are able to: (1) Answer queries about a whole hypothetical evolution of a database, without having to update the entire database and keep the information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 64 شماره
صفحات -
تاریخ انتشار 1993